Model Elimination Without Contrapositives
نویسندگان
چکیده
We present modifications of model elimination which do not necessitate the use of contrapositives. These restart model elimination calculi are proven sound and complete. The corresponding proof procedures are evaluated by a number of runtime experiments and they are compared to other well known provers. Finally we relate our results to other calculi, namely the connection method, modified problem reduction format and Near-Horn Prolog.
منابع مشابه
Refinements of Theory Model Elimination and a Variant without Contrapositives
Theory Reasoning means to build-in certain knowledge about a problem domain into a deduction system or calculus, which is in our case model elimination. Several versions of theory model elimination (TME) calculi are presented and proven complete: on the one hand we have highly restricted versions of total and partial TME. These restrictions allow (1) to keep fewer path literals in extension ste...
متن کاملNear-horn Prolog and the Ancestry Family of Procedures Near-horn Prolog and the Ancestry Family of Procedures
The Near-Horn Prolog procedures have been proposed as eeective procedures in the area of disjunctive logic programming, an extension of logic programming to the ((rst-order) non-Horn clause domain. In this paper, we show that these case-analysis based procedures may be viewed as members of a class of procedures called the \an-cestry family," which also includes Model Elimination (and its varian...
متن کاملOn Merging Theorem Proving and Logic Programming Paradigms (Poster Abstract)
(Poster Abstract) In this poster session, we present the current results of ongoing projects on deduction, disjunctive logic programming, and information management systems, at the University of Koblenz, Germany. The central idea behind these projects is to apply techniques and concepts developed for theorem proving in disjunctive logic programming (thereby achieving a tight integration between...
متن کاملPROTEIN: A PROver with a Theory Extension INterface
PROTEIN (PROver with a Theory Extension INterface) is a PTTPbased first order theorem prover over built-in theories. Besides various standardrefinements known for model elimination, PROTEIN also offers a variant of model elimination for case-based reasoning and which does not need contrapositives. PROTEIN is a complete theorem prover for first order clause logic. It is characterized by the foll...
متن کاملRe nements for Restart Model Elimination
Restart Model Elimination (RME) has been introduced as a variant of model elimination in [1] as a calculus which avoids contrapositives and which introduces case analysis. In [4] a variant for computing answers to disjunctive logic programs was introduced. RME is implemented as part of the PROTEIN system [2]. One result of this paper is a table of completeness results with respect to the combin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1994